Rook numbers and the normal ordering problem
نویسنده
چکیده
Abstract. For an element w in the Weyl algebra generated by D and U with relation DU = UD + 1, the normally ordered form is w = ∑ ci,jU D . We demonstrate that the normal order coefficients ci,j of a word w are rook numbers on a Ferrers board. We use this interpretation to give a new proof of the rook factorization theorem, which we use to provide an explicit formula for the coefficients ci,j . We calculate the Weyl binomial coefficients: normal order coefficients of the element (D +U) in the Weyl algebra. We extend these results to the q-analogue of the Weyl algebra. We discuss further generalizations using i-rook numbers.
منابع مشابه
Normal Order: Combinatorial Graphs
Abstract. A conventional context for supersymmetric problems arises when we consider systems containing both boson and fermion operators. In this note we consider the normal ordering problem for a string of such operators. In the general case, upon which we touch briefly, this problem leads to combinatorial numbers, the so-called Rook numbers. Since we assume that the two species, bosons and fe...
متن کاملA revisit of a mathematical model for solving fully fuzzy linear programming problem with trapezoidal fuzzy numbers
In this paper fully fuzzy linear programming (FFLP) problem with both equality and inequality constraints is considered where all the parameters and decision variables are represented by non-negative trapezoidal fuzzy numbers. According to the current approach, the FFLP problem with equality constraints first is converted into a multi–objective linear programming (MOLP) problem with crisp const...
متن کاملDeriving Fuzzy Inequalities Using Discrete Approximation of Fuzzy Numbers
Most of the researches in the domain of fuzzy number comparisons serve the fuzzy number ordering purpose. For making a comparison between two fuzzy numbers, beyond the determination of their order, it is needed to derive the magnitude of their order. In line with this idea, the concept of inequality is no longer crisp however it becomes fuzzy in the sense of representing partial belonging or de...
متن کاملOn xD-Generalizations of Stirling Numbers and Lah Numbers via Graphs and Rooks
This paper studies the generalizations of the Stirling numbers of both kinds and the Lah numbers in association with the normal ordering problem in the Weyl algebra W = 〈x,D|Dx − xD = 1〉. Any word ω ∈ W with m x’s and n D’s can be expressed in the normally ordered form ω = xm−n ∑ k>0 { ω k } xkDk, where { ω k } is known as the Stirling number of the second kind for the word ω. This study consid...
متن کاملOn the Normal Ordering of Multi-mode Boson Operators
In this article combinatorial aspects of normal ordering annihilation and creation operators of a multi-mode boson system are discussed. The modes are assumed to be coupled since otherwise the problem of normal ordering is reduced to the corresponding problem of the single-mode case. To describe the normal ordering in the multi-mode case for each mode a colour is introduced and coloured contrac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 112 شماره
صفحات -
تاریخ انتشار 2005